Public-Key Steganography with Active Attacks
نویسندگان
چکیده
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CCA) and a relaxation called steganographic security against replayable adaptive chosen-covertext attacks (SSRCCA) are formalized. These notions are closely related with CCA-security and RCCA-security for public-key cryptosystems. In particular, it is shown that any SS-(R)CCA stegosystem is an (R)CCA-secure public-key cryptosystem and that an SS-RCCA stegosystem can be realized from any RCCA-secure public-key cryptosystem with pseudorandom ciphertexts.
منابع مشابه
Toward a theory of Steganography
Informally, steganography refers to the practice of hiding secret messages in communications over a public channel so that an eavesdropper (who listens to all communications) cannot even tell that a secret message is being sent. In contrast to the active literature proposing new concrete steganographic protocols and analysing flaws in existing protocols, there has been very little work on forma...
متن کاملEfficient Public Key Steganography Secure Against Adaptively Chosen Stegotext Attacks
We define the notion of adative chosen stegotext security. We then construct efficient public key steganographic schemes secure against adaptively chosen stegotext attacks, without resort to any special existence assumption such as unbiased functions. This is the first time such a construction is obtained. Not only our constructions are secure, but also are essentially optimal and have no error...
متن کاملDestroying Steganography via Amalgamation: Kleptographically CPA Secure Public Key Encryption
We describe a general technique to protect randomized algorithms against kleptographic attacks. We then apply the technique to construct the first IND-CPA secure public-key encryption scheme in the kleptographic setting. Our scheme preserves IND-CPA security, even when all relevant cryptographic algorithms—including key generation—are subject to adversarial subversion. The scheme requires no tr...
متن کاملEfficient Public Key Steganography Secure Against Adaptive Chosen Stegotext Attacks
We provide construction of steganographic schemes secure against adaptive chosen stegotext attacks. Our constructions achieve embedding rate equals to the Shannon entropy bound on steganographic channel capacity. Further the covertext distribution can be given as either an integrable probability function or as a random covertext sampler. We also introduce steganographic codes that are of intere...
متن کاملA Secure and Robust Certificateless Public Key Steganography Based on SVD-DDWT
Security and undetectability are main goals of steganographic systems. This paper proposes a novel certificateless public key steganography that allows two parties that have no prior knowledge of each other to communicate covertly over public channel. Firstly, secure and high efficient rate of key distribution are provided. Secondly, proper stego and destego are introduced based on Distributed ...
متن کامل